Multi-user Remote Lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm

The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. hybrid algorithm, hybridization Nelder-Mead Simplex and Non-dominated Sorting Genetic Algorithm (NSGA), named (SNSGA), to optimize timetable problem coordinate shared access. algorithm utilizes in terms exploration NSGA sorting local optimum points with consideration potential areas. SNSGA applied difficult nonlinear continuous functions, its performance compared Particle Swarm Optimization, Algorithm, other heuristic algorithms. results show that has competitive address problems.